Protocols and Performance Limits for Half-Duplex Relay Networks
نویسندگان
چکیده
The density of radio access points in currently deployed cellular networks increases in order to improve the reuse of available resources and to serve more user terminals at high data rates. This implies higher deployment costs, which demands low-cost and flexible alternatives. However, this ambitious goal cannot be accomplished with conventional cellular systems but requires new technologies such as multi-cell cooperation, movable radio access points without backhaul connection, and multiple-antenna transmission. This paper concentrates on relaying as one possibility to improve data rates in next-generation mobile networks. More specifically, it introduces protocols and analyzes performance limits in the half-duplex relay channel where multiple relay nodes support a single communication pair. In this channel, nodes underly the orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same time-frequency resource. Based upon this practical consideration, different protocols are discussed and evaluated using a Gaussian system model. For the analyzed scenarios compress-and-forward based protocols provide for a wide range of parameters performance gains over decode-and-forward protocols; this is in contrast to full-duplex networks, where decode-and-forward dominates compress-and-forward in most scenarios. In this paper, a protocol with one compress-and-forward and one decode-and-forward based relay node is introduced. Just as the cut-set upper bound, which operates in a mode where relay nodes transmit alternately, both relays support each other. Furthermore, the performance gains through a random channel access in wireless networks are analyzed and it is shown that in practical systems this strategy provides only marginal performance gains if any.
منابع مشابه
Bounds on the capacity regions of half-duplex Gaussian MIMO relay channels
This article considers uniand bidirectional communication in the half-duplex Gaussian multiple-input multiple-output (MIMO) relay channel. Assuming perfect channel state information at all nodes and the use of time division duplex communications protocol to separate transmissions and receptions at all nodes, we propose a dual decomposition approach to efficiently determine upper and lower bound...
متن کاملAchievable rate regions for bi-directional relaying
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and compare these to four existing half-duplex protocols and outer bounds. In time, our protocols consist of either two or three phases. In the two phase protoco...
متن کاملPerformance of Two-path Successive Relaying in the Presence of Inter-relay Interference
Half-duplex constraint refers to the inability of a radio to transmit and receive signals simultaneously due to the hardware limitation. In cooperative communication, half duplex constraint requires orthogonal time or frequency channel use between source transmission phase and relay transmission phase. This limits the spectral efficiency of conventional relaying to half of the performance of di...
متن کاملBi-directional half-duplex protocols with multiple relays
In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has considered information theoretic limits of the bi-directional relay channel with a single relay. In this work we consider bi-directional relaying with multiple relays. We derive achievable rate regions and outer bounds for half-du...
متن کاملDMT of Multi-hop Cooperative Networks - Part II: Half-Duplex Networks with Full-Duplex Performance
We consider single-source single-sink (ss-ss) multihop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversitymultiplexing gain tradeoff (DMT), few results are available for more general networks. In a companion paper, we characterized end points of DMT of arbitrary ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0907.2309 شماره
صفحات -
تاریخ انتشار 2009